A normal form theorem for lattices completely generated by a subset
نویسندگان
چکیده
منابع مشابه
Subset-Generated Complete Sublattices as Concept Lattices
We present a solution to the problem of finding the complete sublattice of a given concept lattice generated by given set of elements. We construct the closed subrelation of the incidence relation of the corresponding formal context whose concept lattice is equal to the desired complete sublattice. The construction does not require the presence of the original concept lattice. We introduce an e...
متن کاملA Normal Form Theorem for Brjuno Skew-systems through Renormalization
We develop a dynamical renormalization method for the problem of local reducibility of analytic linear quasi-periodic skew-product flows on T2×SL(2,R). This approach is based on the continued fraction expansion of the linear base flow and deals with ’small-divisors’ by turning them into ’large-divisors’. We use this method to give a new proof of a normal form theorem for a Brjuno base flow.
متن کاملNormal Form Theorem for Systems of Sequents
In a system of sequents for intuitionistic predicate logic a theorem, which corresponds to Prawitz’s Normal Form Theorem for natural deduction, are proved. In sequent derivations a special kind of cuts, maximum cuts, are defined. Maximum cuts from sequent derivations are connected with maximum segments from natural deduction derivations, i.e., sequent derivations without maximum cuts correspond...
متن کاملEvans' Normal Form Theorem Revisited
Evans defined quasigroups equationally, and proved a Normal Form Theorem solving the word problem for free extensions of partial Latin squares. In this paper, quasigroups are redefined as algebras with six basic operations related by triality, manifested as coupled right and left regular actions of the symmetric group on three symbols. Triality leads to considerable simplifications in the proof...
متن کاملThe Systematic Normal Form of Lattices
We introduce a new canonical form of lattices called the systematic normal form (SNF). We show that for every lattice there is an efficiently computable ”nearby” SNF lattice, such that for any lattice one can solve lattice problems on its ”nearby” SNF lattice, and translate the solutions back efficiently to the original lattice. The SNF provides direct connections between arbitrary lattices, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1977
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1977-0463058-7